Chang's Conjecture and weak square
نویسنده
چکیده
We investigate how weak square principles are denied by Chang’s Conjecture and its generalizations. Among other things we prove that Chang’s Conjecture does not imply the failure of ω1,2, i.e. Chang’s Conjecture is consistent with ω1,2.
منابع مشابه
Consistency strength of higher chang's conjecture, without CH
We prove that (ω3, ω2) (ω2, ω1) implies there is an inner model with a weak repeat measure.
متن کاملBounded Martin's Maximum, Weak Erd} Os Cardinals, and Ac
We prove that a form of the Erd} os property (consistent with V = LH! 2 ] and strictly weaker than the Weak Chang's Conjecture at !1), together with Bounded Martin's Maximum implies that Woodin's principle AC holds, and therefore 2 @ 0 = @2. We also prove that AC implies that every function f : !1 ! !1 is bounded by some canonical function on a club and use this to produce a model of the Bounde...
متن کاملReliability and advantages of using non-uniform Chang’s attenuation correction method using a CT-based attenuation coefficient map in 99mTc-GSA SPECT/CT hepatic imaging
BACKGROUND Generally, attenuation correction is made by incorporating a linear attenuation coefficient, which is based on the attenuation coefficient map (mu-map) created from a computed tomography scan, into the ordered subsets-expectation maximization reconstruction method in non-uniform domains. A non-uniform Chang's attenuation correction method that uses the mu-map created from a computed ...
متن کاملOn Weak and Strong Sharp Weighted Estimates of Square Function
We reduce here end-point estimates for one singular operator (namely for dyadic square function) to Monge–Ampère equations with drift. The spaces are weighted spaces, and therefore the domain, where we solve our PDE is non-convex. If we are in the end-point situation our goal is either to find a logarithmic blow-up of the norm estimate from below, or to prove that there is upper estimate of the...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Arch. Math. Log.
دوره 52 شماره
صفحات -
تاریخ انتشار 2013